The Kinetic 3D Voronoi Diagram: A Tool for Simulating Environmental Processes
نویسنده
چکیده
Simulations of environmental processes are usually modelled by partial differential equations that are approximated with numerical methods, based on regular grids. An attractive alternative for simulating a fluid flow is the FreeLagrange Method (FLM). In this paper, I discuss the use of the FLM—based on the Voronoi diagram (VD)—for the modelling of fluid flow in three dimensions (e.g. the movement of underground water or of pollution plumes in the ocean). Such a technique requires the kinetic three-dimensional VD, that is a VD for which the points are allowed to move freely in space. I present a new algorithm for the movement of points in a three-dimensional VD, and show that it can be relatively easy to implement as it is the extension of a simple two-dimensional algorithm.
منابع مشابه
Efficient Proximity Search for -D Cuboids
In this paper, we give the definition for the voronoi diagram and its dual graph – Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental result...
متن کاملEfficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi diagram are infinite, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellatio...
متن کاملMCTS Experiments on the Voronoi Game
Monte-Carlo Tree Search (MCTS) is a powerful tool in games with a finite branching factor. This paper describes an artificial player playing the Voronoi game, a game with an infinite branching factor. First, this paper shows how to use MCTS on a discretization of the Voronoi game, and the effects of enhancements such as RAVE and Gaussian processes (GP). A first set of experimental results shows...
متن کامل3D Maps in Mobile Devices: Pathway Analysis for Interactive Navigation Aid
Pathway analysis provided by current 3D maps in mobile devices that are intended for an interactive navigation aid, is simulated for what-if experiments against task and functional analysis, based on the problems faced from both technical and user-practices views. The aim of a navigation aid, in general, is to provide an optimal route from the current position to the destination. Unfortunately,...
متن کاملApproximations of 3D generalized Voronoi diagrams
We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments, lines, polyhedra, etc) and different distance functions (Euclidean metrics, convex distance functions, etc). The approach is based on an octree data structure denoted Voronoi-Octree (VO) that encodes the information required to generate a polyhedral approximation of t...
متن کامل